An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation
نویسندگان
چکیده
Relative convex hulls have been suggested for multigrid-convergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (experimentally) to provide a multigrid convergent measurement. 1 Center for Image Technology and Robotics Tamaki Campus, The University of Auckland, Auckland, New Zealand. [email protected] and [email protected] You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the CITR Tamaki web site under terms that include this permission. All other rights are reserved by the author(s). An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation Linjiang Yu and Reinhard Klette
منابع مشابه
An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation of 3D Digital Objects
Relative convex hulls have been suggested for multigridconvergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating 3D relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (exper...
متن کاملA Comparative Evaluation of Length Estimators
Relative convex hulls have been suggested for multigrid-convergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (experim...
متن کاملNumerical simulation of Laminar Free Convection Heat Transfer around Isothermal Concave and Convex Body Shapes
In the present research, free convection heat transfer from isothermal concave and convex body shapes is studied numerically. The body shapes investigated here, are bi-sphere, cylinder, prolate and cylinder with hemispherical ends; besides, they have the same height over width (H/D = 2). A Numerical simulation is implemented to obtain heat transfer and fluid flow from all of the geometries in a...
متن کاملAugmented convex hull plots: Rationale, implementation in R and biomedical applications
The paper addresses the possibility to replace cluttered multi-group scatter-plots with augmented convex hull plots. By replacing scatter-plot points with convex hulls, space is gained for visualization of descriptive statistics with error bars or confidence ellipses within the convex hulls. An informative addition to the plot is calculation of the area of convex hull divided by corresponding g...
متن کاملSpace Subdivision to Speed-up Convex Hull Construction in E3
Convex hulls are fundamental geometric tools used in a number of algorithms. This paper presents a fast, simple to implement and robust Smart Convex Hull (S-CH) algorithm for computing the convex hull of a set of points in . This algorithm is based on “spherical” space subdivision. The main idea of the S-CH algorithm is to eliminate as many input points as possible before the convex hull constr...
متن کامل